Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time
نویسندگان
چکیده
منابع مشابه
Truly Sub-cubic Algorithms for Language Edit Distance and Rna
It is a major open problem whether the (min,+)-product of two n × n matrices has a truly sub-cubic (i.e. 4 O(n3−ε) for ε > 0) time algorithm, in particular since it is equivalent to the famous All-Pairs-Shortest-Paths problem (APSP) 5 in n-vertex graphs. Some restrictions of the (min,+)-product to special types of matrices are known to admit truly sub-cubic 6 algorithms, each giving rise to a s...
متن کاملComparing Stars: On Approximating Graph Edit Distance
Graph data have become ubiquitous and manipulating them based on similarity is essential for many applications. Graph edit distance is one of the most widely accepted measures to determine similarities between graphs and has extensive applications in the fields of pattern recognition, computer vision etc. Unfortunately, the problem of graph edit distance computation is NP-Hard in general. Accor...
متن کاملApproximating Graph Edit Distance Using GNCCP
The graph edit distance (GED) is a flexible and widely used dissimilarity measure between graphs. Computing the GED between two graphs can be performed by solving a quadratic assignment problem (QAP). However, the problem is NP complete hence forbidding the computation of the optimal GED on large graphs. To tackle this drawback, recent heuristics are based on a linear approximation of the initi...
متن کاملConstant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids in Mostly Sub-Quadratic Time
Let G = (V,E) be an m1 × . . . ×mk grid. Assuming that each v ∈ V is occupied by a robot and a robot may move to a neighboring vertex in a step via synchronized rotations along cycles of G, we first establish that the arbitrary reconfiguration of labeled robots on G can be performed in O(k ∑ i mi) makespan and requires O(|V |) running time in the worst case and o(|V |) when G is non-degenerate ...
متن کاملTime Warp Edit Distance
This technical report details a family of time warp distances on the set of discrete time series. This family is constructed as an editing distance whose elementary operations apply on linear segments. A specific parameter allows controlling the stiffness of the elastic matching. It is well suited for the processing of event data for which each data sample is associated with a timestamp, not ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2020
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3422823